Some Decision Problems for Extended Modular Groups

In this paper we investigate solvability of the word problem for Extended Modular groups, Extended Hecke groups and Picard groups in terms of complete rewriting systems. At the final part of the paper we examine the other important decision problem (conjugacy problem) for only Extended Modular groups

Conjugacy for Free Groups under Split Extensions

At the present paper we show that conjugacy is preserved and reflected by the natural homomorphism defined from a semigroup S to a group G, where G defines split extensions of some free groups. The main idea in the proofs is based on a geometrical structure as applied in the paper [8]

Subgross and macroscopic investigation of the coeliac artery in the chinchilla (chinchilla lanigera)

The knowledge of branching and variations of the coeliac artery is clinicallyimportant, especially in the surgical operations and non-surgical treatments.Moreover, the chinchillas abdominal region have been used as a model in somesurgical experimental researches. In this frame, we have aimed to explain thebranching of this artery in the chinchillas detailedly. A total of 10 adult, healthy,male chinchillas (chinchilla lanigera) were used to investigate the origin and thecourse of the coeliac artery and its branches. Coloured latex was injected intothe carotid arteries, following conventional anatomical applications. The resultsindicated that the coeliac artery was divided into 4 branches such as left gastricartery, hepatic artery, splenic artery and gastrolienal artery. The left gastric arterywas a continuity of the coeliac artery and the main vessel of the stomach. Thehepatic artery was divided into the left lateral branch, the left medial branch andthe right branch. The splenic artery was covered by the pancreas tissue and sentbranches to the pancreas. The gastrolienal artery was supplying the fundus ofthe stomach and the dorsal extremity of the spleen. We believe that the findingswill be of help to the researchers interested in the anatomical area, surgeons andexperimental researches

Two N-terminal regions of the Sendai virus L RNA polymerase protein participate in oligomerization

AbstractThe RNA dependent RNA polymerase of Sendai virus consists of a complex of the large (L) and phosphoprotein (P) subunits where L is thought to be responsible for all the catalytic activities necessary for viral RNA synthesis. We previously showed that the L protein forms an oligomer [Smallwood, S., Cevik, B., Moyer, S.A., 2002. Intragenic complementation and oligomerization of the L subunit of the Sendai virus RNA polymerase. Virology 304, 235–245] and mapped the L oligomerization domain between amino acids 1 and 174 of the protein [Çevik, B., Smallwood, S., Moyer, S.A., 2003. The oligomerization domain resides at the very N-terminus of the Sendai virus L RNA polymerase protein. Virology 313, 525–536]. An internal deletion encompassing amino acids 20 to 178 of the L protein lost polymerase activity but still formed an L–L oligomer. The first 25 amino acids of paramyxovirus L proteins are highly conserved and site-directed mutagenesis within this region eliminated the biological activity of the L protein but did not have any effect on P–L or L–L interactions. Moreover deletion of amino acids 2–18 in L abolished biological activity, but again the L–L binding was normal demonstrating that the oligomerization domain of L protein resides in two N-terminal regions of the protein. Therefore, sequences between both aa 2–19 and aa 20–178 can independently mediate Sendai L oligomerization, however, both are required for the activity of the protein

The next step of the word problem over monoids

It is known that a group presentation P can be regarded as a 2-complex with a single 0-cell. Thus we can consider a 3-complex with a single 0-cell which is known as a 3-presentation. Similarly, we can also consider 3-presentations for monoids. In this paper, by using spher- ical monoid pictures, we show that there exists a finite 3-monoid-presentation which has unsolvable ‘‘generalized identity problem’’ that can be thought as the next step (or one- dimension higher) of the word problem for monoids. We note that the method used in this paper has chemical and physical applications

Finite derivation type for graph products of monoids

Bu çalışma, 08-11, Ağustos 2014 tarihlerinde Gyeongju[Güney Kore]’de düzenlenen 22. International Conference on Finite and Infinite Dimensional Complex Analysis and Applications (ICFIDCAA) Kongresi‘nde bildiri olarak sunulmuştur.The aim of this paper is to show that the class of monoids of finite derivation type is closed under graph products.Balıkesir Üniversitesi - 2014/95, 2015/4